Delay Characterization of Combinational Modules by Functional Arrival Time Analysis

نویسندگان

  • Yuji Kukimoto
  • Robert K. Brayton
چکیده

A combinational module is a combinational circuit that can be used under any arrival time condition. In 8] we showed that exact false-path-aware delay characterization of a com-binational module can be reduced to functional required time analysis 6] of the module. This reduction makes it possible to detect false paths of a combinational module without assuming any speciic arrival time condition at the primary inputs. The delay characteristics of the module are represented by a delay abstraction, which contains eeective delay between each input-output pair under each input vector applied to the module. In this paper we approach the same problem using functional arrival time analysis of the module under an arrival time condition chosen arbitrarily. We prove that if a path sensitization condition is chosen properly, the resulting delay abstraction is a conservative approximation to the exact delay abstraction computed by functional required time analysis regardless of the choice of the arrival time condition. The relationship between the accuracy of delay abstractions computed in this approach and path sen-sitization conditions used in the underlying functional arrival time analysis is clariied. 1 Introduction The goal of this paper is to compute a false-path-aware delay abstraction of a combinational module by performing functional arrival time analysis of the module. A delay abstraction is a compact representation of the delay information of the module, which carries pin-to-pin delay for each primary-input/primary-output pair. The delay can be dependent on input vectors provided to the module. The existence of false paths is captured in the delay abstraction by keeping eeective pin-to-pin delays instead of topological delays. The internal structural details of the module are abstracted away. The major diiculty in computing a false-path-aware delay abstraction of a combinational module is in the requirement that a delay abstraction be valid and accurate under any arrival time condition at the inputs. State-of-the-art path sensitization conditions (e.g. viability 9], oating-mode 4] and XBD0 10]) exploit arrival times at primary inputs to enable accurate false path detection. Therefore, a direct application of those path sensitization conditions does not seem appropriate in this context since we cannot assume speciic arrival times. In 8, 7] we showed that the exact delay abstraction of a module can be computed under the XBD0 model 10] without assuming any arrival time condition. Speciically, the problem was shown to be reducible to functional required time analysis 6]. The approach taken in this paper is …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delay Characterization of Combinational Modules1

We address three related issues on timing characterization of combinational modules. We first introduce a new notion called timing safe-replaceability as a way of comparing the timing characteristics of two combinational modules formally. This notion allows us to determine whether a new module is a safe replacement of an original module in terms of timing under any surrounding environment. Seco...

متن کامل

Removing False Paths from Combinational Modules

The existence of false paths complicates the task of accurate timing analysis significantly. A technique to remove false paths from a combinational circuit without degrading its performance has a practical value since topological timing analysis is then good enough to estimate the performance of false-path-free circuits accurately. One can think of the KMS algorithm [1] as such a procedure. It ...

متن کامل

Hierarchical Timing Analysis under the XBD0 Model

We propose a hierarchical timing analysis technique applicable to the XBD0 delay model, which is the underlying model for floating mode analysis and viability analysis. Given a hierarchical combinational circuit, the timing property of each leaf module is characterized first. Since this timing characterization step takes into account false paths in each module, a timing model constructed is mor...

متن کامل

Static Timing Model Extraction for Combinational Circuits

For large circuits, static timing analysis (STA) needs to be performed in a hierarchical manner to achieve higher performance in arrival time propagation. In hierarchical STA, efficient and accurate timing models of sub-modules need to be created. We propose a timing model extraction method that significantly reduces the size of timing models without losing any accuracy by removing redundant ti...

متن کامل

Telescopic units: a new paradigm for performance optimization of VLSI designs

2 ADD-Based Timing Analysis The problem of calculatin& the timing r8poose of a combin... tionallogic block can be formulated as follows: GiYen a combinational block, find the set of input vectors for which the length of the critical path, under a .pecified mode of operation and a gate delay model, is maximum; the length of the critical path gi~ the overall block delay. Given a gate g of the net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998